Multiple description trellis coded quantization

ABSTRACT

A multiple description TCQ arrangement employs a trellis graph that is the tensor product, such as T 1 {circle over (X)}T 2 , of two trellis graphs, such as T 1  and T 2 . The codevectors of the tensor-product trellis, c 1 , are incorporated within trellis graph T 1  and also within trellis graph T 2 . The incorporation within trellis graph T 1  is effected by assigning the c 1  codevectors to sets, and by deriving therefrom codevectors for trellis graphs T 1  and T 2 . The actual values that these codevectors take on are arranged to insure certain distortion results. Specifically, the distortion measure of the tensor-product trellis is minimized, subject to the condition that the distortion measures of approximations made by decoders operating with the T 1  and T 2  trellises do not exceed a predetermined value. Consequently, an improved arrangement is realized which, two encoders are cooperatively generating separate trellis-coded descriptions of the input sequence. Three different fidelity levels can thus be achieved: a first when only a first description is employed, a second when the second description is employed, and a third (and highest level of fidelity) when both descriptions are employed. This allows for use of receivers that are responsive to different rates, or the use of receivers that have adaptable rates.

RELATED APPLICATION

[0001] This application is related to, and claims priority from, a provisional application filed on Jan. 16, 1998 which carries the Serial No. 60/071749. This application is also related to an application filed on even date herewith, which carries the Serial No. 08/---,---, and is titled “Successively Refinable Trellis Coded Quantization”.

BACKGROUND OF THE INVENTION

[0002] This invention relates to quantizers, and more particularly, to trellis-coded quantizers.

[0003] In recent years rate-scalable source coders have received growing attention. By selecting different sub-streams of the output of such coders, various levels of encoding rate and distortion can be achieved.

[0004] The ability to select different sub-streams is important in various applications. One such application, for example, may relate to receivers that are adapted to operate at one data rate under normal conditions, and adapted to accept a lower data rate when transmission conditions are adverse, while still producing a bonafide output, albeit, of lower fidelity.

[0005] A powerful source coding scheme for memoryless sources is trellis coded quantization. See, for example, M. W. Marcellin and T. R. Fischer, “Trellis coded quantization of memoryless and Gauss-Markov sources,” IEEE Trans. Comm., vol. 38, pp. 82-93, January 1990. It has been shown that for a memoryless uniform source, trellis coded quantizers (TCQs) provide mean squared errors (MSEs) within 0.21 dB of the theoretical distortion bounds (for given rates). The performance of a trellis-coded quantization (TCQ) arrangement is much better than that of the best scalar quantizer (Lloyd-Max quantizer) at the same rate.

[0006] Rate scalability can be achieved with successive refinement, as well as with multiple descriptions. Successive refinement refers to the notion of a transmitter sending one stream of data which can decode the desired signal, albeit with lower fidelity, and one or more additional streams of data that refined the decoded output. Although until now, it has been thought that trellis coding does not lend itself to successive refinability, the aforementioned co-pending discloses a successively refinable trellis quantizer.

[0007] Multiple description refers to the notion of a transmitter sending more than one description of a given sequence. A receiver accepting one of the descriptions can reproduce the signal with a certain fidelity, and a receiver accepting both descriptions can reproduce the signal with a higher fidelity. Unlike with successive refinement, either one of the multiple descriptions can be used to decode the signal.

[0008] Multiple description scenarios have a well-established history, but no present publications exist that disclose the use of multiple description coding in the context of trellis quantization. The challenge is to realize simple and effective multiple description arrangements for trellis coding.

SUMMARY

[0009] A multiple description TCQ arrangement is achieved by employing a trellis graph that is the tensor product, such as T₁{circle over (X)}T₂, of two trellis graphs, such as T₁ and T₂ . The codevectors of the tensor-product trellis, c₁, are incorporated within trellis graph T₁ and also within trellis graph T₂ . The incorporation within trellis graph T₁ is effected by assigning the c₁ codevectors to sets, and by deriving therefrom codevectors for trellis graphs T₁ and T₂ . The actual values that these codevectors take on are arranged to insure certain distortion results. Specifically, the distortion measure of the tensor-product trellis is minimized, subject to the condition that the distortion measures of approximations made by decoders operating with the T₁ and T₂ trellises do not exceed a predetermined value. Consequently, an improved arrangement is realized which, two encoders are cooperatively generating separate trellis-coded descriptions of the input sequence. Three different fidelity levels can thus be achieved: a first when only a first description is employed, a second when the second description is employed, and a third (and highest level of fidelity) when both descriptions are employed. This allows for use of receivers that are responsive to different rates, or the use of receivers that have adaptable rates.

BRIEF DESCRIPTION OF THE DRAWING

[0010]FIG. 1 shows a one-bit trellis coding graph;

[0011]FIG. 2 presents a two-bit, four-state, trellis coding graph arrangement with parallel transitions;

[0012]FIG. 3 illustrates the structure of a tensor-product trellis graph creates from trellis graphs having the FIG. 1 structure;

[0013]FIG. 4 depicts a block diagram of an arrangement where an encoder that produces multiple (two) descriptions of an input sequence feeds three receivers, and where one receiver is responsive to one description, a second receiver is responsive to the second description, and one receiver is responsive to both descriptions;

[0014]FIG. 5 shows a heuristic approach for making index assignments; and

[0015]FIG. 6 presents an algorithm for ascertaining optimized encoder threshold levels.

DETAILED DESCRIPTION

[0016] For sake of simplicity and ease of understanding, the trellis graph that is employed in the following disclosure is the relatively simple, four state, trellis graph shown in FIG. 1 and described in the aforementioned Marcellin et al publication. It should be understood, however, that use of the FIG. 1 trellis graph is not a requirement of this invention. It is merely illustrative. Other one-bit-per sample trellis graphs can be used, as well as trellis graphs employing a larger number of bits per sample.

Multiple Transitions Trellis

[0017] The four-state trellis of FIG. 1 has two transitions from each state, and a signal level that is associated with each transition. For example, a level c₀ for transitions V₀ to V₀ and V₂ to V₁, c₁ for transitions V₁ to V₂ and V₃ to V₃, c₂ for transitions V₀ to V₁ and V₂ to V₀ and c₃ for transitions V₁ to V₃ and V₃ to V₂, where c₀<C₁<C₂<C₃. When encoding, each input sample causes a transition in the graph from a current state to a next state, based on the signal level of the input sample and the signal levels that are associated with the transitions emanating from the current state. More specifically, in determining which transition to take, a distortion cost measure is evaluated by ascertaining the distance between the input sample and the two levels that are relevant in the current state of the trellis. The transition selected dictates the value of an output bit of the encoder. For example in state V₁ only levels c₁ and c₃ are relevant, and a transition from state V₁ to V₃ might indicate that the input sample is closer to level c₃ than to level c₁.

[0018] Trellises that have a larger number of signal levels, and a corresponding larger number of transitions from any one state, produce a larger number of bits per sample. Such trellises can have, but do not have to have, more than four states. Indeed, a four-state trellis of the type shown in FIG. 1 can be employed for any number of bits per sample, simply by employing parallel transitions. Accordingly, even if one were to restrict all embodiments to four-state trellis graphs, such as the one depicted in FIG. 1, the generality of the present disclosure would not be diminished. The following briefly reviews the concept of multiple transitions.

[0019] When it is desired to quantize a sequence of signal samples with R bits per sample, 2^(R+1) signal levels c₁, i=0,1,. . ., (2^(R+1)−1) are used in the trellis encoding process. In the decoding process, the received bits select from among signal levels e₁, i=0,1,. . ., (2^(R+)−1) thereby approximating the sequence of input samples. Typically, the e₁ levels are equal to the c₁ levels. If levels cl are enumerated in ascending order, and if the four-transition trellis graph of FIG. 1 is to be employed for encoding, then the set of levels is partitioned into four subsets in such a manner that every fourth level belongs to the same subset, i.e. each C₄ _(1+m) for i=0,1,. . . goes into subset A_(m), where m=0,1,2,3. The levels in each subset A_(m) are then assigned to parallel transitions from one particular state to another particular state, yielding a four-state trellis graph with multiple transitions and 2^(R+1) levels. Typically, the c₁'s and the e₁'s is levels are scalar. Generally, however, they can be multi-dimensional vectors and, therefore, some practitioners refer to these levels as “codevectors”.

[0020] To illustrate, FIG. 2 depicts a trellis graph for R=3, where there are four transition from any one state to another state. Thus, when an encoder is residing in state 31 in FIG. 2, a label D0, D2, D4, D6, D8, D 10, D 12, or D 14, is selected based on whether the sample to be quantized is closest to either c₀, c₂, c₄, c₆, c₈, c₁₀, c₁₂, or c₁₄, respectively. Labels D0, D4, D 8, and D 12 correspond to a transition from state 31 to state 41 in FIG. 2, and labels D2, D6, D 10 and D14 correspond to a transition from state 31 to state 42 in FIG. 2. The output bits that are delivered by the quantizer are selected based on the label attached, and can be, for example, as shown in the table below: Transition Transition from 31 to Output from 32 to Output 41 & 42 bits 43 & 44 bits D0 000 D1 000 D2 100 D3 100 D4 001 D5 001 D6 101 D7 101 D8 010 D9 010 D10 110 D11 110 D12 011 D13 011 D14 111 D15 111

Tensor-Product Trellis

[0021] If T₁ and T₂ denote trellises with states v₁, v₂, . . ., v₂ _(^(h1)) , and w₁, w₂, . . ., w₂ _(^(b2)) , respectively, then the tensor-product trellis T₁{circle over (X)}T₂ is a trellis with 2^(b1+b2) states v_(p)×w_(q), where p=1,2, . . . 2^(b1), and q=1,2,. . ., 2^(b2). This is illustrated in FIG. 3 for b1=b2=2, where two four-state trellis graphs are combined to form a tensor-product trellis. As can be seen from FIG. 3, a transition between states v_(p)×w_(q) and v_(r)×w_(s) in T₁{circle over (X)}T₂ exists if, and only if, there exist transitions between v_(p) and v_(r) in T₁ and between w_(q) and w_(s) in T₂. For example, there exists a transition between state v₁×w₁ of the T₁{circle over (X)}T₂ graph and state v₂×w₁ of the T₁{circle over (X)}T₂ graph in FIG. 3, because there exists a transition between states v₁ and v₂ in the T₁ trellis graph of FIG. 3, and there is also a transition between states w₀ and w₀ in the T₂ trellis graph of FIG. 3. This attribute allows the tensor-product trellis to be used as a TCQ that develops a multiply- descriptive output code.

[0022] In other words, it is possible to construct a trellis-coded encoder that produces a coded sequence of bits corresponding to trellis T₁ and a coded sequence of bits corresponding to trellis, and a decoder that is responsive to the two-coded sequences with codevectors that are associated with the tensor-product trellis T₁{circle over (X)}T₂.

Illustrative Embodiment

[0023] An illustrative physical embodiment of such an arrangement is presented in FIG. 4, where encoder 100 includes an encoder 110 which belongs to a first TCQ (TCQ1), characterized by trellis graph T₁, and an encoder 120 which belongs to a second TCQ (TCQ2) characterized by trellis graph T₂ . Encoder 100 thus outputs two distinct signals. One of the signals, passing through channel 120 and having the rate R1 bits per sample, arrives at receivers 140. That same signal passes through channel 122 as it arrives at receiver 150. The other of the, passing through channel 130 and having the rate R2 bits per sample, arrives at receivers 160, and that same signal passes through channel 132 as it arrives at receiver 150. Receiver 140 includes a decoder for TCQ1 (employing trellis graph T₁), and receiver 160 includes a decoder for TCQ2 (employing trellis graph T₂). Receiver 150, realizing a combined, or central, TCQ (TCQ0), includes a decoder employing the tensor-product trellis T₁{circle over (X)}T₂ . As described more fully below, receiver 150 develops an approximation of the encoded signal with a certain, minimized, level of distortion, while receivers 140 and 160 develop an approximation of the encoded signal with a larger level of distortion than that of receiver 150. The distortion produced by receivers 140 and 160 need not be equal, however.

[0024] Although the FIG. 4 arrangement depicts three receivers, it should be understood that this depiction is primarily for the purpose of describing the encoding and decoding operations, and the design process involved. In practice, it is expected that a transmitter will be at least capable of outputting multiple descriptions, but in some applications it might not actually output those descriptions automatically. In some applications the multiple descriptions will be transmitted automatically, perhaps over disparate channels. In other applications, the multiple descriptions might be transmitted only in response to certain conditions. FIG. 4 shows two TCQ encoders on the encoding side, but it should be understood that a larger number of TCQ encoders are possible, with each providing its own description of the input sequence of samples.

[0025] On the decoding side, in some applications one may find three kinds of receivers that are used concurrently by different users. A receiver may be adapted to decode the sequence that arrives a the rate R1 bits per sample (one description), another receiver may be adapted to decode the sequence that arrives a the rate R2 bits per sample (another description), and still another receiver may be adapted to decode the sequence that arrives at the rate R1+R2 bits per sample. In other applications, receivers may be adapted to accept any of the above three rates, based, perhaps, on channel conditions or wishes of the user. More particularly, a receiver may be adapted to accept any subset of the multiple descriptions and create an output that is based on the received (i.e., received without errors that are not correctable) descriptions.

Trellis Codevectors

[0026] Returning to the design issues of the three TCQs, the variables that need to be ascertained are

[0027] a) codevectors employed in encoder 110 and receiver 140 (codevectors b_(k) ¹ for TCQ1);

[0028] b) codevectors employed in encoder 120 and receiver 160 (codevectors b_(j) ² for TCQ2); and

[0029] c) codevectors employed in receiver 150 (codevectors c₁ for TCQ0).

[0030] It is clear that codevectors c, need to be selected to produce a good output at receiver 150, and codevectors b_(k) ¹ and b_(j) ² need to be selected to produce a good output at receivers 140 and 160, respectively. Of course, one would rightly expect that receiver 150, which is responsive to more information, would produce an output with less distortion than the distortion at the outputs of receivers 140 and 160, which are responsive to less information. In deciding on the proper values of c₁, b_(k) ¹, and b_(j) ², one could select the b_(k) ¹ and b_(j) ² codevectors that independently produce the lowest distortion out of receivers 140 and 160, respectively, and then decide on the c₁ codevectors that would give the lowest distortion at the output of receiver 150, given the fact that the signal was encoded with the previously selected b_(k) ¹ and b_(j) ² codevectors. Thereafter, one would undertake a refinement process to modify the selected codevectors so as to improve the distortion measure at the output of receiver 150, at the cost of degrading the performance at the output of receivers 140 and 160, to insure that receiver 150 provides the least-distorted output.

[0031] Conversely, one could select the c₁ codevectors that would give the lowest distortion at the output of receiver 150, then select the b_(k) ¹ and b_(j) ² codevectors and ascertain whether some preselected maximum level of distortion has been exceeded. If so, one would undertake a refinement process to modify the selected c, codevectors, and corresponding b_(k) ¹ and b_(j) ² codevectors, to improve performance at the output of receivers 140 and 160, at the expense of performance at the output of receiver 150.

[0032] We have ascertained that a relationship exists between the c₁ codevectors and the b_(k) ¹, and b_(j) ² codevectors, and in accordance with the principles disclosed herein, the c₁, b_(k) ¹, and b_(j) ² codevectors are determined concurrently.

[0033] Proceeding with the relationship between b_(k) ¹, b_(j) ², and c₁, codevectors c₁ are partitioned into two groups. The first group, set aside for TCQ1, contains 2^(R) ^(₁) ⁺¹ subsets B_(k) ¹, k=0,1,. . ., (2^(R) _(¹) +¹−1), where each subset consists of 2^(R) ^(₂) ⁺¹ c₁'s. Similarly, the second group, set aside for TCQ2, contains 2^(R) ^(₂) ⁺¹ subsets B_(j) ², where each subset consists of 2^(R) ^(₁) ⁺¹ c₁'s. To illustrate, when R1=R2=1, the partitioning results in four subsets B₀ ¹, B₁ ¹, B₂ ¹, and B₃ ¹ for TCQ1, and four subsets B₀ ², B₁ ², B₂ ², and B₃ ² for TCQ2.

[0034] When R1 or R2 is greater than 1, the number of subsets in the corresponding group is a higher power of two, and is divisible by four. If, as indicated above, the designer wishes to employ a four-state trellis with parallel transitions, such as in FIG. 2, then a subset having more than four members is itself partitioned into four subsets A_(m) ¹, and/or A_(m) ², to create a TCQ1, or a TCQ2, as the case may be, with multiple transitions.

[0035] Every pair of paths in T₁ and T₂ identifies a path in T₁{circle over (X)}T₂, and it corresponds to a path of length N in T₁ and a path of length N in T₂. The transitions in T₁ correspond to codevectors selected from b₀ ¹, b₁ ¹, b₂ ¹, and b₃ ¹ which are derived from subsets B₀ ¹, B₁ ¹, B₂ ¹, and B₃ ¹, respectively. Likewise, the transitions in T₂ correspond to codevectors selected from b₀ ², b₁ ², b₂ ², and b₃ ², which are derived from subsets B₀ ², B₁ ², B₂ ², and B₃ ², respectively. More specifically, the b_(k) ¹ levels correspond to the centroids of B_(k) ¹, and the b_(j) ² levels correspond to the centroids of B_(j) ².

[0036] In the context of this disclosure, the centroid of a subset corresponds to the sum of all members of the set, c₁, each multiplied by a fraction that corresponds to the area under the probability distribution of the input signals, in the region where input signals are closer to member c₁ than to any other member of the set. For example, a simple illustrative probability distribution for input signals might be triangular in shape, beginning with 0 at −1.0, increasing linearly to a maximum of 1.0 at 0, and then decreasing linearly to 0 at +1.0. Given, for example, a subset containing members {−0.8, −0.7, −0.6, −0.5}, the four resulting intervals are −1.0 to −0.75, −0.75 to −0.65, −0.65 to −0.55, and −0.55 to +1.0. The centroid would then be ${- \left( {0.8 \cdot \frac{0.25^{2}}{2}} \right)} - {(0.7)\quad (0.1)\quad (0.3)}$

[0037] −(0.6)(0.1)(0.4)−(0.5) $\left( {\frac{1.45 \cdot 0.55}{2} + 0.5} \right) = {- {0.522775.}}$

[0038] The n^(th) transition in the TCQ0 trellis is defined by the codevector that remains from the intersection of the B subsets (i.e., B_(k) ¹∩B_(j) ²) that are involved in the n^(th) transition of TCQ1 and TCQ2. Clearly, then, the assignment of codevectors c₁ to sets B_(k) ¹ and B_(j) ² should be such that B_(k) ¹∩B_(j) ² in non-zero, and unique for all i and j. This translates to a requirement that precisely one c₁ should be shared between any pair of B_(k) ¹ and B_(j) ². This, in turn, means that members of any particular subset B_(k) ¹ must be members in different ones of subsets B_(j) ². A simple way to achieve such an assignment is to use a two-dimensional table, such as the one shown in FIG. 5, where each row specifies the c₁'s that are assigned for a particular b_(k) ¹ of TCQ1, and each column specifies the c₁'s that are assigned for a particular b_(j) ² of TCQ2.

[0039] Heuristically, it has been shown that a reasonable starting assignment is achieved by ordering the c₁'s in ascending order and by assigning the ordered c₁'s in accordance with a path such as the one outlined in FIG. 5. With reference to FIG. 3, the assignments in FIG. 5 correspond to transition assignments expressed in the following Table 1. TABLE 1 b₀ ¹ b₁ ¹ b₂ ¹ b₃ ¹ b₀ ² c₀ c₁ c₅ c₆ v₀ × w₀ → v₀ × w₀ v₀ × w₁ → v₀ × w₂ v₀ × w₀ → v₀ × w₁ v₀ × w₁ → v₀ × w₃ v₀ × w₂ → v₀ × w₁ v₀ × w₃ → v₀ × w₃ v₀ × w₂ → v₀ × w₀ v₀ × w₃ → v₀ × w₂ v₂ × w₀ → v₁ × w₀ v₂ × w₁ → v₁ × w₂ v₂ × w₀ → v₁ × w₁ v₂ × w₁ → v₁ × w₃ v₂ × w₂ → v₁ × w₀ v₂ × w₃ → v₁ × w₃ v₂ × w₂ → v₁ × w₀ v₂ × w₃ → v₁ × w₂ b₁ ² c₂ c₄ c₇ c₁₂ v₁ × w₀ → v₂ × w₀ v₁ × w₁ → v₂ × w₂ v₁ × w₀ → v₂ × w₁ v₁ × w₁ → v₂ × w₃ v₁ × w₂ → v₂ × w₁ v₁ × w₃ → v₂ × w₃ v₁ × w₂ → v₂ × w₀ v₁ × w₃ → v₂ × w₂ v₃ × w₀ → v₃ × w₀ v₃ × w₁ → v₃ × w₂ v₃ × w₀ → v₃ × w₁ v₃ × w₁ → v₃ × w₃ v₃ × w₂ → v₃ × w₁ v₃ × w₃ → v₃ × w₃ v₃ × w₂ → v₃ × w₀ v₃ × w₃ → v₃ × w₂ b₂ ² c₃ c₈ c₁₁ c₁₃ v₀ × w₀ → v₁ × w₀ v₀ × w₁ → v₁ × w₂ v₀ × w₀ → v₁ × w₁ v₀ × w₁ → v₁ × w₃ v₀ × w₂ → v₁ × w₁ v₀ × w₃ → v₁ × w₃ v₀ × w₂ → v₁ × w₀ v₀ × w₃ → v₁ × w₂ v₂ × w₀ → v₀ × w₀ v₂ × w₁ → v₀ × w₂ v₂ × w₀ → v₀ × w₁ v₂ × w₁ → v₀ × w₃ v₂ × w₂ → v₀ × w₁ v₂ × w₃ → v₀ × w₃ v₂ × w₂ → v₀ × w₀ v₂ × w₃ → v₀ × w₂ b₃ ² c₀ c₁₀ c₁₄ c₁₅ v₁ × w₀ → v₃ × w₀ v₁ × w₁ → v₃ × w₂ v₁ × w₀ → v₃ × w₁ v₁ × w₁ → v₃ × w₃ v₁ × w₂ → v₃ × w₁ v₁ × w₃ → v₃ × w₃ v₁ × w₂ → v₃ × w₀ v₁ × w₃ → v₃ × w₂ v₃ × w₀ → v₂ × w₀ v₃ × w₁ → v₂ × w₂ v₃ × w₀ → v₂ × w₁ v₃ × w₁ → v₂ × w₃ v₃ × w₂ → v₂ × w₁ v₃ × w₃ → v₂ × w₃ v₃ × w₂ → v₂ × w₀ v₃ × w₃ → v₂ × w₂

[0040] Table 2 below shows the correspondence between the codevectors of TCQ0 and the codevectors for TCQ1 and TCQ2 for the assignments made in FIG. 5.

[0041] Consequently, the c₁'s that are assigned to subsets B_(k) ¹ and B_(j) ² are: $\begin{matrix} {B_{0}^{1} = \left\{ {c_{0},c_{1},c_{5},c_{6}} \right\}} & {B_{0}^{2} = \left\{ {c_{0},c_{2},c_{3},c_{9}} \right\}} \\ {B_{1}^{1} = \left\{ {c_{2},c_{4},c_{7},c_{12}} \right\}} & {B_{1}^{2} = \left\{ {c_{1},c_{4},c_{8},c_{10}} \right\}} \\ {B_{2}^{1} = \left\{ {c_{3},c_{8},c_{11},c_{13}} \right\}} & {B_{2}^{2} = \left\{ {c_{5},c_{7},c_{11},c_{14}} \right\}} \\ {B_{3}^{1} = \left\{ {c_{9},c_{10},c_{14},c_{15}} \right\}} & {B_{3}^{2} = \left\{ {c_{6},c_{12},c_{13},c_{15}} \right\}} \end{matrix}$

[0042] To complete the design, the actual values of the c₁, b_(k) ¹, and b_(j) ² codevectors need to be selected and, in accordance with the principle disclosed above, concurrently optimized for signals having a particular signal probability distribution. Thus, the codevectors need to be optimized in conformance with the objective to minimize the distortion measure D of TCQ0, subject to the condition that the resulting distortion measure D1 of TCQ1 is not greater than d1 and the resulting distortion measure D2 of TCQ2 is not greater than d2.

[0043] Using Lagrange multipliers λ₁ and λ₂, the above-expressed constrained minimization problem can be converted to a non-constrained minimization problem of the form:

min{D+λ ₁ D ₁+λ₂ D ₂}  (1)

[0044] For a given pair of multipliers λ₁ and λ₂ and a training sequence x(n) with N samples, an illustrative distortion measure cost function can be expressed by $\begin{matrix} {{J = {{\frac{1}{N}{\sum\limits_{n = 1}^{N}\left\lbrack {{x(n)} - {\hat{x}(n)}} \right\rbrack^{2}}} + {\lambda_{1}\left\lbrack {{x(n)} - {{\hat{x}}^{1}(n)}} \right\rbrack}^{2} + {\lambda_{2}\left\lbrack {{x(n)} - {{\hat{x}}^{2}(n)}} \right\rbrack}^{2}}},} & (2) \end{matrix}$

[0045] where {circumflex over (x)}(n) is the decoded approximation of sample x(n) in TCQ0, {circumflex over (x)}¹ (n) is the decoded approximation of sample x(n) in TCQ1, and {circumflex over (x)}² (n) is the decoded approximation of sample x(n) in TCQ2. The objective, then, is to minimize the combined distortion measure, J, by iteratively modifying the values of codevectors b_(k) ¹, b_(j) ², and c₁ until the distortion constraints are met, and further modifications fail to sufficiently improve the value of J to merit continued modifications.

[0046] In the process of optimizing the values of codevectors c₁, b_(k) ¹, and b_(j) ², if Y_(l) is the set of all training samples which are encoded as c₁ in TCQ0, and |Y_(l)| is the number of elements in set Y_(i), then replacing each codevector c₁ with a new codevector {tilde over (c)}_(l) defined by $\begin{matrix} {{{\overset{\sim}{c}}_{i} = {\frac{1}{Y_{l}}{\sum\limits_{{x{(n)}} \in Y_{i}}{x(n)}}}},} & (3) \end{matrix}$

[0047] results in a lower distortion D, when the same path and codewords which have been used for the old codevectors are utilized. Note that since we are dealing with a trellis coder, the fact that some x(n)εY_(l) does not necessarily means that c₁ is the closest codevector to x(n) . As the c₁ values are modified in each iteration, the corresponding b_(k) ¹, and b_(j) ² values are also modified, as disclosed above.

[0048]FIG. 6 presents a flow chart of the process for ascertaining the actual c₁, b_(k) ¹, and b_(j) ² values. Block 200 is the initialization block. This block identifies the probability distribution for the input signals, and in conformance with that distribution selects a training sequence. It then chooses an initial set of c₁ codevectors, and computes an initial set of b_(k) ¹, and b_(j) ² codevectors. It selects λ₁ and λ₂ , sets the 0^(th) iteration of the distortion measure, J⁽⁰⁾, to a large number, and sets iteration index r to 1. Control then passes to block 210 where the training sequence is encoded, using the Viterbi algorithm, using equation (2) as the distortion measure. Block 220 decodes the encoded signals using codevectors c₁, b_(k) ¹, and b_(j) ² to obtain sequences {circumflex over (x)}(n), {circumflex over (x)}¹(n), and {circumflex over (x)}²(n) , respectively, and block 230 computes J^((r)). Decision block 240 evaluates $\frac{J^{({r - 1})} - J^{(r)}}{J^{(r)}},$

[0049] which is a measure of improvement in distortion measure, J, and compares it to a preselected threshold, ε. If the measure of improvement is greater than ε, control passes to block 250 which updates codevectors c₁ in accordance with equations (3), and correspondingly update codevectors b_(k) ¹, and b_(j) ². Thereafter, the index r is incremented in block 260, and control returns to block 210. If the measure of improvement is not greater than ε, then the iterative process for the selected Lagrange multipliers terminates. Block 270 then computes distortions D1 and D2 by evaluating $\begin{matrix} {{D1} = {\frac{1}{N}{\sum\limits_{n = 1}^{N}\left\lbrack {{x(n)} - {{\hat{x}}^{1}(n)}} \right\rbrack^{2}}}} & (4) \end{matrix}$

[0050] and $\begin{matrix} {{D2} = {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\left\lbrack {{x(n)} - {{\hat{x}}^{2}(n)}} \right\rbrack^{2}.}}}} & (5) \end{matrix}$

[0051] Block 280 determines whether either one of the distortions is greater than the maximum specified distortion (e.g., the condition is TRUE if D1>d1). If so, control passes to block 290, where the corresponding Lagrange multiplier is reduced (in this example, λ₁) to allow that component to have greater effect in the calculations of equation (2). Block 290 also resets the iteration index, r, to 1, and returns control to block 210. The process is repeated until both D1 and D1 are not greater than d1 and d2, respectively.

[0052] Since the FIG. 6 process alters the c₁ levels, it is possible that the order of the c₁ thresholds might change. For example, it is possible that the value of c₅ has grown to be larger than c₇ and that the value of c₄ has become less than the value of c₃. Repositioning the TCQ1 and TCQ2 codevectors, the altered table would be TABLE 3 TCQ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 TCQ1 0 0 1 1 2 0 1 0 2 3 3 2 1 2 3 3 TCQ2 0 1 0 1 0 3 2 2 1 0 1 2 3 3 2 3

[0053] And the new set of assignments for B_(k) ¹ and B_(j) ² becomes: $\begin{matrix} {B_{0}^{1} = \left\{ {c_{0},c_{1},c_{5},c_{7}} \right\}} & {B_{0}^{2} = \left\{ {c_{0},c_{2},c_{4},c_{9}} \right\}} \\ {B_{1}^{1} = \left\{ {c_{2},c_{3},c_{6},c_{12}} \right\}} & {B_{1}^{2} = \left\{ {c_{1},c_{3},c_{8},c_{10}} \right\}} \\ {B_{2}^{1} = \left\{ {c_{4},c_{8},c_{11},c_{13}} \right\}} & {B_{2}^{2} = \left\{ {c_{5},c_{6},c_{11},c_{14}} \right\}} \\ {B_{3}^{1} = \left\{ {c_{9},c_{10},c_{14},c_{15}} \right\}} & {B_{3}^{2} = {\left\{ {c_{7},c_{12},c_{13},c_{15}} \right\}.}} \end{matrix}$

[0054] The above disclosure illustrates the principles of this invention; however, various modifications and enhancements can be introduced by artisans without departing from the spirit and scope of this invention, which is defined by the following claims. For example, the trellises that form the “building-blocks” of the tensor trellis can be replaced with other trellises, and do not have to be the same as the trellises. Also, although the above discloses the principles of this invention in the context of trellis coded quantization (TCQ) using scalar levels, it should be understood that these principles also apply to vectors (TCVQ), to entropy-coded TCQ, and to entropy-coded TCVQ. The generalized class that includes TCQ, TCVQ, entropy-coded TCQ, and to entropy-coded TCVQ is termed herein GTCQ. 

We claim:
 1. Apparatus comprising: a first GTCQ encoder that encodes an input sequence to developing a first encoded description; a second GTCQ encoder that encodes said input sequence to developing a second encoded description; where the encoding performed said first and the encoding performed in said second GTCQ encoders are performed by considering a distortion measure that concurrently accounts for distortions created in said first GTCQ encoder and in said second GTCQ encoder.
 2. The apparatus of claim 1 where said distortion measure, J, is expressed by a combination that includes samples {circumflex over (x)}(n) , which are decoded approximations of input samples x(n) in a receiver that is responsive to said first encoded description and to said encoded second description, samples {circumflex over (x)}¹(n), which are decoded approximations of sample x(n) in a receiver that is responsive to said first encoded description, and samples {circumflex over (x)}²(n) , which are decoded approximations of sample x(n) in a receiver that is responsive to said second encoded description.
 3. The apparatus of claim 2 where said distortion measure, J, is expressed by ${J = {{\frac{1}{N}{\sum\limits_{n = 1}^{N}\left\lbrack {{x(n)} - {\hat{x}(n)}} \right\rbrack^{2}}} + {\lambda_{1}\left\lbrack {{x(n)} - {{\hat{x}}^{1}(n)}} \right\rbrack}^{2} + {\lambda_{2}\left\lbrack {{x(n)} - {{\hat{x}}^{2}(n)}} \right\rbrack}^{2}}},$

where N is the number of samples in an encoded frame of samples in said input sequence, and λ₁ and λ₂ are preselected constants.
 4. The apparatus of claim 1 where said first GTCQ encoder employs codevectors b_(k) ¹, and said second GTCQ encoder employs codevectors b_(j) ², are both related to a set of codevectors c₁, where k is an index {0, 1, . . . 2^(R1+1)−1} and R1 is the number of bits per sample created in said first GTCQ encoder, j is an index {0, 1, . . . 2^(R2+1)−1} and R2 is the number of bits per sample created in said second GTCQ encoder, and i in an index {0, 1, . . . 2^(R1+R2+2)−1}
 5. The apparatus of claim 4 where said b_(k) ¹ codevectors and said b_(j) ² codevectors are related to distinct subsets of said c₁ codevectors.
 6. Apparatus comprising: a receiver for accepting an M plurality of encoded sequences ; and a GTCQ decoder employing an M order tensor-product trellis graph, T₁{circle over (X)}T₂{circle over (X)}T₃{circle over (X)}.. T_(M), which corresponds to a tensor product of M GTCQ trellis graphs.
 7. The apparatus of claim 6 where M=2, the tensor-product graph is T₁{circle over (X)}T₂, where T₁ is a GTCQ trellis graph employed in developing one of said M plurality of encoded sequences, and where T₂ is a GTCQ trellis graph employed in developing another of said M plurality of encoded sequences.
 8. The apparatus of claim 7 where said tensor product graph employs codevectors c₁, said T₁ GTCQ trellis graph employs codevectors b_(k) ¹, and said T₂ GTCQ trellis graph employs codevectors b_(j) ², where the b_(k) ¹ and b_(j) ² codevectors are related to distinct subsets of codevectors c₁.
 9. The apparatus of claim 8 where the b_(k) ¹ and b_(j) ² codevectors are centroids of distinct subsets of codevectors c₁.
 10. The apparatus of claim 6 further comprising control means for directing a transmitter to transmit said M plurality of encoded sequences seriatim.
 11. The apparatus of claim 6 where said GTCQ decoder is modifiable to employ a tensor-product GTCQ trellis graph of order lower than M, and further comprising control means for identifying a subset of K sequences from said M plurality of encoded sequences, and for modifying said GTCQ decoder to employ a K order GTCQ trellis, T₁{circle over (X)}T₂{circle over (X)}T₃{circle over (X)}.. {circle over (X)}T_(K), where K is any integer from 1 to M.
 12. The apparatus of claim 11 where said GTCQ decoder is modifiable to employ a tensor-product GTCQ trellis graph T₁{circle over (X)}T₂, a GTCQ trellis graph T₁, or a GTCQ trellis graph T₂. 